import java.util.Scanner;

/**
 * @author vivi
 * @description
 * @date 2024/5/12
 */
public class demo1 {
    //判断两数之差是否为质数
    public static boolean isPrime (int max, int min){
        int n = max - min;
        if(n < 2) return false;
        //                  n/2
        for(int i = 2; i <= Math.sqrt(n); i++)
        {
            if(n % i == 0) return false;
        }
        return true;
    }
    public static void main (String[] args) {
        Scanner scanner = new Scanner(System.in);
        char[] arr = scanner.next().toCharArray();

        int[] hash = new int[26];

        for (int i = 0; i < arr.length; i++){
            hash[arr[i] - 'a']++;
        }

        int max = Integer.MIN_VALUE;
        int min = Integer.MAX_VALUE;

        for (int i = 0; i < 26; i++) {
            if (hash[i] != 0){
                max = Math.max(max, hash[i]);
                min = Math.min(min, hash[i]);
            }
        }

        boolean flag = isPrime(max, min);
        if(flag == true){
            System.out.println("Lucky Word");
            System.out.println(max - min);
        }else {
            System.out.println("No Answer");
            System.out.println(0);
        }
    }
}
